Triangle-free planar graphs with small independence number
نویسندگان
چکیده
منابع مشابه
Triangle-free planar graphs with small independence number
Since planar triangle-free graphs are 3-colourable, such a graph with n vertices has an independent set of size at least n/3. We prove that unless the graph contains a certain obstruction, its independence number is at least n/(3−ε) for some fixed ε > 0. We also provide a reduction rule for this obstruction, which enables us to transform any plane triangle-free graph G into a plane triangle-fre...
متن کاملEdge number critical triangle free graphs with low independence numbers
The structure of all triangle free graphs G = (V,E) with |E|−6|V |+α(G) = 0 is determined, yielding an affirmative answer to a question of Stanis law Radziszowsky and Donald Kreher.
متن کاملOriented colorings of triangle-free planar graphs
Oriented graphs are directed graphs without opposite arcs. In other words an oriented graph is an orientation of an undirected graph, obtained by assigning to every edge one of the two possible orientations. IfG is a graph, V (G) denotes its vertex set, E(G) denotes its set of edges (or arcs if G is an oriented graph) and F (G) denotes its set of faces if G is planar. A homomorphism from an ori...
متن کاملFractional Coloring of Triangle-Free Planar Graphs
We prove that every planar triangle-free graph on n vertices has fractional chromatic number at most 3− 1 n+1/3 .
متن کامل3-coloring triangle-free planar graphs with a precolored
5 Given a triangle-free planar graph G and a cycle C of length 9 in G, we characterize 6 all situations where a 3-coloring of C does not extend to a proper 3-coloring of G. This 7 extends previous results for the length of C up to 8. 8
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2019
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2018.09.008